Automatic Result Verification by Complete Run-Time Checking of Computations

نویسندگان

  • Edgar F. A. Lederer
  • Romeo A. Dumitrescu
چکیده

Received (received date) Revised (revised date) Communicated by Editor's name ABSTRACT Two-Stage Programming (2sp) is an experimental programming language, the rst implementation of the Speciication-Consistent Coordination Model (SCCM). The SCCM proposes a new, mixed-paradigm (functional/imperative) approach to developing reliable programs based on complete run-time checking of computations with respect to a given speciication. A 2sp program consists of a functional speciication and an imperative coordination tightly connected to the speciication. The coordination maps the speciication to an imperative and possibly parallel/distributed program. Normal termination of a 2sp program execution implies the correctness of the computed results with respect to the speciication, for that execution. We present the basic features of the SCCM/2sp, a new message-passing system of 2sp with integrated run-time checking , and a larger case study. We show that 2sp provides: functional speciications, speciication-consistent imperative coordinations, automatic run-time result veriication and error detection, enhanced debugging support, and good eeciency.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Automatic Result Veriication by Complete Run-time Checking of Computations

Two-Stage Programming (2sp) is an experimental programming language, the rst implementation of the Speciication-Consistent Coordination Model (SCCM). The SCCM proposes a new, mixed-paradigm (functional/imperative) approach to developing reliable programs based on complete run-time checking of computations with respect to a given speciication. A 2sp program consists of a functional speciication ...

متن کامل

Automatic Large-Scale Software Verification by Abstract Interpretation

interpretation is a theory of abstraction and constructive approximation of the mathematical structures used in the formal description of programming languages and the inference or verification of undecidable program properties. Developed in the late seventies with Radhia Cousot, it has since then been considerably applied to many aspects of programming, from syntax, to semantics, and proof met...

متن کامل

Automatic Flight Code Generation with Integrated Static Run-Time Error Checking and Code Analysis

Model-Based Design with automatic flight code generation is used to develop a variety of aerospace electronic systems including integrated avionics, jet engine controls, and flight control systems. The software deployed in these systems undergoes rigorous verification and validation because the consequences of software failure are severe. New code checking and analysis tools have recently emerg...

متن کامل

Practical Construction of Correct Compiler Implementations by Runtime Result Verification

Software verification is an expensive and tedious job, even software in safety critical applications is tested only. This paper deals with the construction of compilers as an exmaple for big software systems that are hard to verifiy. We describe how program-checking can be used to establish the full correctness of optimizing compilers which may be partly generated by unverified construction too...

متن کامل

A Hybrid Meta-heuristic Approach to Cope with State Space Explosion in Model Checking Technique for Deadlock Freeness

Model checking is an automatic technique for software verification through which all reachable states are generated from an initial state to finding errors and desirable patterns. In the model checking approach, the behavior and structure of system should be modeled. Graph transformation system is a graphical formal modeling language to specify and model the system. However, modeling of large s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Int. J. Found. Comput. Sci.

دوره 12  شماره 

صفحات  -

تاریخ انتشار 2001